PROPOSAL OF TWO DIMENSIONAL FLOOD ROUTING METHOD
نویسندگان
چکیده
منابع مشابه
Application of a One-Dimensional Computer Model to Flood Routing in Narrow Rivers
This paper deals with the development of a computer model for flood routing in narrow rivers. Equations describing the propagation of a flood wave in a channel-flood plain system are presented and solved using an implicit finite difference scheme. Particular emphasis has been given to the treatment of the friction term in the governing equation of motion.
متن کاملCompressing Two-Dimensional Routing Tables1
We consider an algorithmic problem that arises in the context of routing tables used by Internet routers. The Internet addressing scheme is hierarchical, where a group of hosts are identified by a prefix that is common to all the hosts in that group. Each host machine has a unique 32-bit address. Thus, all traffic between a source group s and a destination group d can be routed along a particul...
متن کاملDirected Flood-Routing Framework
The Directed Flood-Routing Framework (DFRF) for wireless sensor networks that allows the rapid development of application specific routing protocols based on directed flooding is introduced in this paper. Flood-routing protocols are probabilistic methods that make only the best effort to route data packets. The presented family of protocols can route regular sized data packets via broadcast mes...
متن کاملDifferential Transform Method to two-dimensional non-linear wave equation
In this paper, an analytic solution is presented using differential transform method (DTM) for a class of wave equation. The emphasis is on the nonlinear two-dimensional wave equation. The procedures introduced in this paper are in recursive forms which can be used to obtain the closed form of the solutions, if they are required. The method is tested on various examples, and the results reveal ...
متن کاملGlobal Wiire Routing in Two-Dimensional Arrayst
Very Brief Abstract We examine the .problem of routing wires on a VLSI chip, where the pins to be· connected are arranged in a regular rectangular array. We obtain tight bounds for the worst-case "channelwidth" needed to route an n X n array, and develop provably good heuristics for the general case. An interesting "rounding algorithm for obtaining integral approximations to solutions of linear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PROCEEDINGS OF HYDRAULIC ENGINEERING
سال: 1996
ISSN: 0916-7374,1884-9172
DOI: 10.2208/prohe.40.413